Duality theorems and an optimality condition for non-differentiable convex programming
نویسندگان
چکیده
منابع مشابه
Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملMixed symmetric duality in non-differentiable multiobjective mathematical programming
Two mixed symmetric dual models for a class of non-differentiable multiobjective nonlinear programming problems with multiple arguments are introduced in this paper. These two mixed symmetric dual models unify the four existing multiobjective symmetric dual models in the literature. Weak and strong duality theorems are established for these models under some mild assumptions of generalized conv...
متن کاملDuality and Convex Programming
This chapter surveys key concepts in convex duality theory and their application to the analysis and numerical solution of problem archetypes in imaging.
متن کاملOn duality theory for non-convex semidefinite programming
In this paper, with the help of convex-like function, we discuss the duality theory for nonconvex semidefinite programming. Our contributions are: duality theory for the general nonconvex semidefinite programming when Slater’s condition holds; perfect duality for a special case of the nonconvex semidefinite programming for which Slater’s condition fails. We point out that the results of [2] can...
متن کاملOptimality Conditions and Duality for DC Programming in Locally Convex Spaces
Received 10 February 2009; Revised 25 June 2009; Accepted 25 September 2009 Recommended by K. L. Teo Consider the DC programming problem PA infx∈X{f x − g Ax }, where f and g are proper convex functions defined on locally convex Hausdorff topological vector spaces X and Y, respectively, and A is a linear operator from X to Y . By using the properties of the epigraph of the conjugate functions, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1982
ISSN: 0263-6115
DOI: 10.1017/s1446788700024927